WPSR: Word Plane Sweep Replicated, Present a Plane sweep Algorithm to optimize the use of Replicated data in a document

This paper describes the plane sweep algorithm for optimal use of tandem replicated data in a document. It is based on an observation that the original plane sweep algorithm is used to search in documents. Plane sweep algorithm does not feature a fast algorithm to find the word that is repeated in tandem in a document. With the help of effective parameters we could make a new technique to create the algorithm that detect the number of tandem replicated words in a document and reduce the number of compares, thus reducing the number of keywords in a document speed up our search algorithm. For this purpose we need to have a link between words and documents that the proposed algorithm WPSR provides a similar solution as original plane sweep algorithm. However, considering the volume of data we get the canonical form that this situation helps us to increases recognition of duplicate words in large scale. In proposed algorithm time complexity with lower order has been created than the basic algorithm, also terms of the algorithm with the WPSR system reliability, consider the best web search. Finally, system efficiency and performance increase more than the previous similar algorithm in this field.